A Hierarchical Semantic Overlay for P2P Search
نویسندگان
چکیده
In this paper, we propose a hierarchical semantic overlay network for searching heterogeneous data over wide-area networks. In this system, data are represented as RDF triples based on ontologies. Peers that have the same semantics are organized into a semantic cluster, and the semantic clusters are self-organized into a one-dimensional ring space to form the toplevel semantic overlay network. Each semantic cluster has its low-level overlay network which can be built using an unstructured overlay or a DHT-based overlay. A search is first forwarded to the appropriate semantic cluster, and then routed to the specific peers that hold the relevant data using a parallel flooding algorithm or a DHT-based routing algorithm. By combining the advantages of both unstructured and structured overlay networks, we are able to achieve a better tradeoff in terms of search efficiency, search cost and overlay maintenance
منابع مشابه
Distributed Information Retrieval Based on Hierarchical Semantic Overlay Network
One fundamental problem that confronts information retrieval is to efficiently support query with higher accuracy and less logic hops. This paper presents HSPIR (Hierarchical Semantic P2P-based Information Retrieval) that distributes document indices through the P2P network hierarchically based on documents semantics generated by Latent Semantic Indexing (LSI) [1]. HSPIR uses CAN [2] and Range ...
متن کاملA Small World Overlay Network for Semantic Based Search in P2P Systems
For a peer-to-peer (P2P) system holding massive amount of data, efficient search for resources (such as data or services) is a key determinant to its scalability. This paper presents semantic small world (SSW), an overlay network and index structure for semantic based P2P search. By dynamically clustering peer nodes in a semantic space based on the semantics of their data and organizing the clu...
متن کاملAn Efficient Semantic Search Scheme for Decentralized P2P Environment
Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn’t support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple languages and keywords search. The simulation results indicate the average search length of DUSTO method is 7...
متن کاملSPSS: A Case of Semantic Peer-to-Peer Search System
Traditional search system approaches have either been centralized or use flooding to ensure accuracy of the results returned which have bad performance. This paper presents SPSS (Semantic Peer-to-Peer Search System) that search documents through the P2P network hierarchically based on document semantic vector generated by Latent Semantic Indexing (LSI) [1]. The search cost for a given query is ...
متن کاملBittella: A new protocol for unstructured p2p networks based on the Small World per Content Structure
In this paper we propose a new protocol for unstructured and semantic-searching based p2p networks: Bittella. It forms a three level overlay network: the lower level is the unstructured p2p network (e.g. Gnutella). The medium level is formed by clusters per content, we call the resulting structure Small World per Content structure. This level allows the utilization of Bittorrent-like download t...
متن کامل